Finite - state Automata on In nite Inputs
نویسنده
چکیده
This paper is a self-contained introduction to the theory of nite-state automata on innnite words. The study of automata on innnite inputs was initiated by B uchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed interest in these automata because of the fundamental role they play in the automatic veriication of nite-state systems.
منابع مشابه
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate nite-state automata and nite-state transducers. Manipulations include determinization (both for nite-state accep-tors and nite-state transducers), minimization, composition, comple-mentation, intersection, Kleene closure, etc. Furthermore, various visu-alization tools are available to browse nite-state autom...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملMeasures of Nondeterminism in Finite Automata
While deterministic nite automata seem to be well understood, surprisingly many important problems concerning nondeterministic nite automata (nfa's) remain open. One such problem area is the study of di erent measures of nondeterminism in nite automata and the estimation of the sizes of minimal nondeterministic nite automata. In this paper the concept of communication complexity is applied in o...
متن کاملA Note on the Ambiguity of Finite Automata
We give a new and simple proof of a key lemma on the rank of a matrix in Leung's paper [3], where he showed there exists a family of nondeterministic nite automata fAng, with n states and exponential ambiguity, such that any smallest equivalent polynomially ambiguous nite automaton has 2 1 states. Keyword: nondeterministic automata, ambiguity, automata theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996